Computing the Fréchet Distance with a Retractable Leash

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Fréchet Distance with a Retractable Leash

All known algorithms for the Fréchet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values. We present a novel approach that avoids the detour through the decision version. This gives the first quadratic time algorithm for the Fréchet distance between...

متن کامل

Computing the Fréchet Gap Distance

Measuring the similarity of two polygonal curves is a fundamental computational task. Among alternatives, the Fréchet distance is one of the most well studied similarity measures. Informally, the Fréchet distance is described as the minimum leash length required for a man on one of the curves to walk a dog on the other curve continuously from the starting to the ending points. In this paper we ...

متن کامل

Computing Fréchet Distance with Speed Limits

In this paper, we study a problem on computing the Fréchet distance between two polygonal curves and provide efficient solutions for solving it. In the classical Fréchet distance, point objects move arbitrarily fast on the polygonal curves. Here, we consider the problem instance where the speed per segment is a constant within a specified range. We first describe a naive algorithm which solves ...

متن کامل

Computing the Fréchet Distance between Folded Polygons

We present the first results showing that the Fréchet distance between non-flat surfaces can be approximated within a constant factor in polynomial time. Computing the Fréchet distance for surfaces is a surprisingly hard problem. It is not known whether it is computable, it has been shown to be NP-hard, and the only known algorithm computes the Fréchet distance for flat surfaces (Buchin et al.)...

متن کامل

On Computing the Fréchet Distance Between Surfaces

We describe two (1 + ε)-approximation algorithms for computing the Fréchet distance between two homeomorphic piecewise linear surfaces R and S of genus zero and total complexity n, with Fréchet distance δ. 1. A 2 (( n+ Area(R)+Area(S) (εδ)2 )2) time algorithm if R and S are composed of fat triangles (triangles with angles larger than a constant). 2. An O(D/(εδ)2) · n + 2O(D/(εδ)) time algorithm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2016

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-016-9800-8